Church’s Types in Logical Reasoning on Programming

نویسنده

  • Valerie NOVITZKÁ
چکیده

In our paper [1] we have introduced the basic concepts and facts for scientific problem solving by help of mathematical machines, i.e. by logical reasoning about programming of these machines. These fundamental concepts were: category, cartesian closed category, diagram and limit, topos and elementary topos, but the most important was the concept of basic types. Basic types actually form the starting point in the process of scientific problem solving by mathematical machines. The main purpose of this paper is to introduce a bit extended type system, the so called Church’s type system as a further step of the scientific problem solving process by mathematical machines.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linear Logical Reasoning on Programming

In our paper we follow the development of our approach of regarding programming as logical reasoning in intuitionistic linear logic. We present basic notions of linear logic and its deduction system and we define categorical semantics of linear logic as a symmetric monoidal closed category. Then we construct linear type theory over linear Church’s types involving linear calculus with equational...

متن کامل

Mechanized metatheory revisited

Proof assistants and the programming languages that implement them need to deal with a range of linguistic expressions that involve bindings. Since most mature proof assistants do not have built-in methods to treat this aspect of syntax, they have been extended with various packages and libraries that allow them to encode such syntax using, for example, de Bruijn numerals and nominal logic feat...

متن کامل

The Church Synthesis Problem with Metric

Church’s Problem asks for the construction of a procedure which, given a logical specification φ(I,O) between input strings I and output strings O, determines whether there exists an operator F that implements the specification in the sense that φ(I, F (I)) holds for all inputs I. Büchi and Landweber gave a procedure to solve Church’s problem for MSO specifications and operators computable by f...

متن کامل

Knowledge Representation, Computation, and Learning in Higher-order Logic

This paper contains a systematic study of the foundations of knowledge representation, computation, and learning in higher-order logic. First, a polymorphically-typed higher-order logic, whose origins can be traced back to Church’s simple theory of types, is presented. A model theory and proof theory for this logic are developed and basic theorems relating these two are given. A metric space of...

متن کامل

Instrumental Reasoning Reconsidered

since Aristotle it has been common among philosophers to distinguish between two fundamental types of reasoning, theoretical and practical. We do not only want to work out what is the case but also what we ought to do. This article offers a logical analysis of instrumental reasoning, which is the paradigm of practical reasoning. In the first section I discuss the major types of instrumental rea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006